The FC-rank of a context-free language
نویسندگان
چکیده
We prove that the finite condensation rank (FC-rank) of the lexicographic ordering of a context-free language is strictly less than ω.
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملWord Problem Languages for Free Inverse Monoids
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of rank 1 is both 2-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank 1 is context...
متن کاملA Critical Functional Approach to Educational Discourses of Students and Professors over the Internet Context
This paper investigated the ways Iranian B.A and M.A students of English language and their professors represent themselves linguistically in their e-mails in general, and the ways they construct and negotiate power with regard to social and cultural norms in particular. It examined 84 e-mail messages students and professors exchanged in 2012-2013 academic year through Halliday`s Systemic Funct...
متن کاملInvestigating the Effect of Scaffolded Extensive Reading as an Anxiety Reducing Strategy in an Iranian EFL Context
Foreign Language Reading Anxiety (FLRA), distinguished as a distinct phenomenon from general language anxiety, has been shown to have a negative impact on reading comprehension skill especially for less proficient EFL learners. FLRA is believed to originate from "unfamiliar writing system" or learners' difficulty in pronouncing words and sentences (Saito, Graza, & Horwitz, 1999). Slow or word b...
متن کاملMultiple Context-Free Tree Grammars: Lexicalization and Characterization
Multiple (simple) context-free tree grammars are investigated, where “simple” means “linear and nondeleting”. Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one (generating the same tree language) in which each rule of the grammar contains a lexical symbol. Due to this transformation, the rank of the nonterm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 113 شماره
صفحات -
تاریخ انتشار 2013